Some remarks on Toeplitz multipliers and Hankel matrices
نویسندگان
چکیده
منابع مشابه
Irreducible Toeplitz and Hankel matrices
An infinite matrix is called irreducible if its directed graph is strongly connected. It is proved that an infinite Toeplitz matrix is irreducible if and only if almost every finite leading submatrix is irreducible. An infinite Hankel matrix may be irreducible even if all its finite leading submatrices are reducible. Irreducibility results are also obtained in the finite cases.
متن کاملBalanced Random Toeplitz and Hankel Matrices
Except for the Toeplitz and Hankel matrices, the common patterned matrices for which the limiting spectral distribution (LSD) are known to exist share a common property–the number of times each random variable appears in the matrix is (more or less) the same across the variables. Thus it seems natural to ask what happens to the spectrum of the Toeplitz and Hankel matrices when each entry is sca...
متن کاملFast Algorithms for Toeplitz and Hankel Matrices
The paper gives a self-contained survey of fast algorithms for solving linear systems of equations with Toeplitz or Hankel coefficient matrices. It is written in the style of a textbook. Algorithms of Levinson-type and of Schur-type are discussed. Their connections with triangular factorizations, Padè recursions and Lanczos methods are demonstrated. In the case in which the matrices possess add...
متن کاملRemarks on Extreme Eigenvalues of Toeplitz Matrices
Let f be a nonnegative integrable function on [-r,r], T.Cf) the Ca+l) X(n+l) Toeplitz matrix associated with f and k,. its smallest eigenvalue. It is shown that the convergence of )t,. to rain f(O) can be exrmnentiallv fast even when f does not satisfy the smoothness condition of Kae, Murdoeh and Szeg6 (1953). Also a lower bound for ),,. corresponding to a large class of functions which do not ...
متن کاملGeneralized inversion of Toeplitz-plus-Hankel matrices
In many applications, e.g. digital signal processing, discrete inverse scattering, linear prediction etc., Toeplitz-plus-Hankel (T + H) matrices need to be inverted. (For further applications see [1] and references therein). Firstly the T +H matrix inversion problem has been solved in [2] where it was reduced to the inversion problem of the block Toeplitz matrix (the so-called mosaic matrix). T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Studia Mathematica
سال: 2006
ISSN: 0039-3223,1730-6337
DOI: 10.4064/sm175-2-5